Thirteenth annual IEEE Symposium on switching and automata theory

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Thirteenth annual pezcoller symposium: focusing analytical tools on complexity in cancer.

The physiopathology of cancer cells is the result of very complex signaling networks that represent in many cases distortions of the orderly networks regulating the physiology of normal cells. These networks are the consequence of the expression of, or the lack of expression of, genes, mutated or not, which represent the genomic profile of different types of or of individual cancers. The comple...

متن کامل

Relating Word and Tree Automata - Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on

I n the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60's) it was known that deterministic Biichi word automata are less expressive than nondeterministic Biichi word automata. The proof is easy and can be stated in a few lines. I n the late 60's) Rabin ...

متن کامل

On the speedup required for combined input and output queued switching - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on

Architectures based on a non-blocking fabric, such as a crosspoint switch, are attractive for use in high-speed LAN switches, ATM switches and IP routers. These fabrics, coupled with memory bandwidth limitations, dictate t ha t queues be placed at the input of the switch. But i t is well known that input-queueing can lead to low throughput, a n d does not allow the control of latency through t ...

متن کامل

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory , 2000 Barrier Boosting

Abstract Boosting algorithms like AdaBoost and Arc-GV are iterative strategies to minimize a constrained objective function, equivalent to Barrier algorithms. Based on this new understanding it is shown that convergence of Boosting-type algorithms becomes simpler to prove and we outline directions to develop further Boosting schemes. In particular a new Boosting technique for regression – -Boos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1974

ISSN: 0022-0000

DOI: 10.1016/s0022-0000(74)80025-5